Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic

Binary decision diagrams (BDDs) are widely used to mitigate the state-explosion problem in model checking. A variation of BDDs Zero-suppressed Decision Diagrams (ZDDs) which omit variables that must be false, instead omitting do not matter. We use ZDDs symbolically encode Kripke models Dynamic Epistemic Logic, a framework reason about knowledge and information dynamics multi-agent systems. compare memory usage different ZDD variants for three well-known examples from literature: Muddy Children, Sum Product puzzle Dining Cryptographers. Our implementation is based on existing checker SMCDEL CUDD library. results show replacing with right variant can significantly reduce usage. This suggests useful tool checking